32 research outputs found
Confluence by Decreasing Diagrams -- Formalized
This paper presents a formalization of decreasing diagrams in the theorem
prover Isabelle. It discusses mechanical proofs showing that any locally
decreasing abstract rewrite system is confluent. The valley and the conversion
version of decreasing diagrams are considered.Comment: 17 pages; valley and conversion version; RTA 201
Labelings for Decreasing Diagrams
This article is concerned with automating the decreasing diagrams technique
of van Oostrom for establishing confluence of term rewrite systems. We study
abstract criteria that allow to lexicographically combine labelings to show
local diagrams decreasing. This approach has two immediate benefits. First, it
allows to use labelings for linear rewrite systems also for left-linear ones,
provided some mild conditions are satisfied. Second, it admits an incremental
method for proving confluence which subsumes recent developments in automating
decreasing diagrams. The techniques proposed in the article have been
implemented and experimental results demonstrate how, e.g., the rule labeling
benefits from our contributions
Certified Rule Labeling
The rule labeling heuristic aims to establish confluence of (left-)linear term rewrite systems via decreasing diagrams. We present a formalization of a confluence criterion based on the interplay of relative termination and the rule labeling in the theorem prover Isabelle. Moreover, we report on the integration of this result into the certifier CeTA, facilitating the checking of confluence certificates based on decreasing diagrams for the first time. The power of the method is illustrated by an experimental evaluation on a (standard) collection of confluence problems